A New Parallel Lanczos Eigensolution Technique in MSC

نویسنده

  • Louis Komzsik
چکیده

The Lanczos eigensolution takes the dominant amount of time in most normal modes and modal frequency response analyses. This paper introduces a way to reduce the elapsed time of large eigenvalue jobs by using a newly developed parallel option within the Lanczos algorithm. We will compare the performance of the frequency domain decomposition based distributed memory parallel method introduced in V70.7 and the new, geometry domain decomposition based distributed parallel method introduced in Version 2001. The new method may be utilized on clusters of workstations or even PCs, and naturally on distributed or shared memory parallel computers. It is applicable to very large NVH models of the automobile industry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Computation of Eigenvector Sensitivities for Structural Dynamics via Conjugate Gradients*

An iterative procedure is presented for computing eigenvector sensitivities due to finite element model parameter variations. The present method is a Preconditioned Conjugate Projected Gradient-based technique and is intended to utilize the existing matrix factorizations developed for an iterative eigensolution such as Lanczos or Subspace Iteration. As such, this technique can be integrated int...

متن کامل

Developing a new model for availability optimization applied to a series-parallel system (Quality Engineering Conference Paper)

Redundancy technique is known as a way to enhance the reliability and availability of non-reparable systems, but for repairable systems, another factor is getting prominent called as the number of maintenance resources. In this study, availability optimization of series-parallel systems is modelled by using Markovian process by which the number of maintenance resources is located into the obje...

متن کامل

An improved parallel block Lanczos algorithm over GF(2) for integer factorization

RSA is one of the most popular algorithms for public-key cryptosystems. The security of this algorithm relies on the difficulty of factoring large integers. GNFS is the most efficient algorithm for factoring large integers over 110 digits, and solving the large sparse linear system over GF(2) is one of the most time-consuming steps in the GNFS. In the thesis proposal, an improved and more effic...

متن کامل

A Parallel GNFS Algorithm Based on a Reliable Look-Ahead Block Lanczos Method for Integer Factorization

The Rivest-Shamir-Adleman (RSA) algorithm is a very popular and secure public key cryptosystem, but its security relies on the difficulty of factoring large integers. The General Number Field Sieve (GNFS) algorithm is currently the best known method for factoring large integers over 110 digits. Our previous work on the parallel GNFS algorithm, which integrated the Montgomery’s block Lanczos met...

متن کامل

A Parallel GNFS Algorithm with the Biorthogonal Block Lanczos Method for Integer Factorization

Currently, RSA is a very popular, widely used and secure public key cryptosystem, but the security of the RSA cryptosystem is based on the difficulty of factoring large integers. The General Number Field Sieve (GNFS) algorithm is the best known method for factoring large integers over 110 digits. Our previous work on the parallel GNFS algorithm, which integrated the Montgomery’s block Lanczos a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000